Linear scaling computation of the Fock matrix. VII. Parallel computation of the Coulomb matrix
نویسندگان
چکیده
منابع مشابه
determinant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولComputation of the Adjoint Matrix
Abstract. The best method for computing the adjoint matrix of an order n matrix in an arbitrary commutative ring requires O(n log n log log n) operations, provided the complexity of the algorithm for multiplying two matrices is γn + o(n). For a commutative domain – and under the same assumptions – the complexity of the best method is 6γn/(2 − 2) + o(n). In the present work a new method is prese...
متن کاملThe Matrix Model of Computation
The Matrix Model of Computation (MMC) is a new Turing-complete virtual machine that serves as a formal container for the structural representation and analysis of systems, and finds applications in diverse areas such as Business, Software Engineering and Theoretical Physics. The MMC is a unifying notion in Systemics. It allows uniform, interoperable techniques to be applied to systems in genera...
متن کاملParallel Computation of the SVD of a Matrix Product
In this paper we study a parallel algorithm for computing the singular value decomposition SVD of a product of two matrices on message passing multiprocessors This algorithm is related to the classical Golub Kahan method for computing the SVD of a single matrix and the recent work carried out by Golub et al for computing the SVD of a general matrix product quotient The experimental results of o...
متن کاملParallel Algorithms for Computation of the Manipulator Inertia Matrix
This paper presents the development of an O(log 2 N) parallel algorithm for the manipulator inertia matrix. It is based on the most efficient serial algorithm which uses the composite rigid body method. Recursive doubling is used to reformulate the linear recurrence equations which are required to compute the diagonal elements of the matrix. It results in O(log 2 N) levels of computation. Compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2004
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.1790891